Перевод: со всех языков на русский

с русского на все языки

elementary proof

См. также в других словарях:

  • Elementary proof — In mathematics a proof is said to be elementary if it avoids difficult ideas from distant areas of mathematics. For example, the term is used in number theory to refer to proofs that make no use of complex analysis. An elementary proof in… …   Wikipedia

  • Proof that 22/7 exceeds π — Proofs of the famous mathematical result that the rational number 22⁄7 is greater than π date back to antiquity. What follows is a modern mathematical proof that 22⁄7 > π, requiring only elementary techniques from calculus. The purpose is not… …   Wikipedia

  • Elementary — ist ein im Jahre 2007 entstandenes freies Software Projekt. Ursprünglich war es eine Sammlung von Programmen und Designs für Ubuntu, jetzt verfügt es über seine eigene Linux Distribution welche den Namen elementary OS trägt. Die erste Version,… …   Deutsch Wikipedia

  • Elementary symmetric polynomial — In mathematics, specifically in commutative algebra, the elementary symmetric polynomials are one type of basic building block for symmetric polynomials, in the sense that any symmetric polynomial P can be expressed as a polynomial in elementary… …   Wikipedia

  • Proof of impossibility — A proof of impossibility, sometimes called a negative proof or negative result , is a proof demonstrating that a particular problem cannot be solved, or cannot be solved in general. Often proofs of impossibility have put to rest decades or… …   Wikipedia

  • Proof sketch for Gödel's first incompleteness theorem — This article gives a sketch of a proof of Gödel s first incompleteness theorem. This theorem applies to any formal theory that satisfies certain technical hypotheses which are discussed as needed during the sketch. We will assume for the… …   Wikipedia

  • Elementary group theory — In mathematics, a group is defined as a set G and a binary operation on G , called product and denoted by infix * . Product obeys the following rules (also called axioms). Let a , b , and c be arbitrary elements of G . Then: *A1, Closure. a * b… …   Wikipedia

  • Proof of Bertrand's postulate — In mathematics, Bertrand s postulate (actually a theorem) states that for each n ≥ 2 there is a prime p such that n < p < 2 n . It was first proven by Pafnuty Chebyshev, and a short but advanced proof was given by Srinivasa Ramanujan. The gist of …   Wikipedia

  • Mathematical proof — In mathematics, a proof is a convincing demonstration (within the accepted standards of the field) that some mathematical statement is necessarily true.[1][2] Proofs are obtained from deductive reasoning, rather than from inductive or empirical… …   Wikipedia

  • Combinatorial proof — In mathematics, the term combinatorial proof is often used to mean either of two types of proof of an identity in enumerative combinatorics that either states that two sets of combinatorial configurations, depending on one or more parameters,… …   Wikipedia

  • Computer-assisted proof — A computer assisted proof is a mathematical proof that has been at least partially generated by computer. Most computer aided proofs to date have been implementations of large proofs by exhaustion of a mathematical theorem. The idea is to use a… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
… Нажмите правой клавишей мыши и выберите «Копировать ссылку»